Quality Assessment of Pareto Set Approximations
نویسندگان
چکیده
This chapter reviews methods for the assessment and comparison of Pareto set approximations. Existing set quality measures from the literature are critically evaluated based on a number of orthogonal criteria, including invariance to scaling, monotonicity and computational effort. Statistical aspects of quality assessment are also considered in the chapter. Three main methods for the statistical treatment of Pareto set approximations deriving from stochastic generating methods are reviewed. The dominance ranking method is a generalization to partially-ordered sets of a standard non-parametric statistical test, allowing collections of Pareto set approximations from two or more stochastic optimizers to be directly compared statistically. The quality indicator method — the dominant method in the literature — maps each Pareto set approximation to a number, and performs statistics on the resulting distribution(s) of numbers. The attainment function method estimates the probability of attaining each goal in the objective space, and looks for significant differences between these probability density functions for different optimizers. All three methods are valid approaches to quality assessment, but give different information. We explain the scope and drawbacks of each approach and also consider some more advanced topics, including multiple testing issues, and using combinations of indicators. The chapter should be of interest to anyone concerned with generating and analysing Pareto set approximations.
منابع مشابه
Why Quality Assessment Of Multiobjective Optimizers Is Difficult
Quantitative quality assessment of approximations of the Pareto-optimal set is an important issue in comparing the performance of multiobjective evolutionary algorithms. Most popular are methods that assign each approximation set a vector of real numbers that reflect different aspects of the quality. In this study, we investigate this type of quality assessment from a theoretical point of view....
متن کاملMetrics for Quality Assessment of a Multiobjective Design Optimization Solution Set
In this paper, several new set quality metrics are introduced that can be used to evaluate the ‘‘goodness’’ of an observed Pareto solution set. These metrics, which are formulated in closed-form and geometrically illustrated, include hyperarea difference, Pareto spread, accuracy of an observed Pareto frontier, number of distinct choices and cluster. The metrics should enable a designer to eithe...
متن کاملStochastic convergence of random search to fixed size Pareto set approximations
This paper presents the first convergence result for random search algorithms to a subset of the Pareto set of given maximum size k with bounds on the approximation quality ǫ. The core of the algorithm is a new selection criterion based on a hypothetical multilevel grid on the objective space. It is shown that, when using this criterion for accepting new search points, the sequence of solution ...
متن کاملThe Hypervolume Indicator Revisited: On the Design of Pareto-compliant Indicators Via Weighted Integration
The design of quality measures for approximations of the Pareto-optimal set is of high importance not only for the performance assessment, but also for the construction of multiobjective optimizers. Various measures have been proposed in the literature with the intention to capture different preferences of the decision maker. A quality measure that possesses a highly desirable feature is the hy...
متن کاملComputing Gap Free Pareto Front Approximations with Stochastic Search Algorithms
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The focus was on obtaining a finite approximation that captures the entire solution set in some suitable sense, which was defined by the concept of epsilon-dominance. Though bounds on the quality of the limit approximation...
متن کامل